On implementation of online testable state machines
نویسنده
چکیده
This paper presents a technique for designing self–checking finite state machines that uses a 2-hot code for state encoding. The registers and output logic in resulting state machines are testable online. A new method for designing the output logic is also proposed in this paper Key-Words: Fault Detection, State Machines, Online Testing, Transient Faults, Permanent Faults
منابع مشابه
An Approach for Designing On-Line Testable State Machines
1. Introduction Synthesis of state machines have attracted the attention of researchers for more than two decades. Several state assignment techniques that result in efficient implementation of the next state logic have been developed [1-3]. However, none of these addresses the testability of an implemented machine. A popular approach for enhancing the testability of a state machine is to modif...
متن کاملOnline State Space Model Parameter Estimation in Synchronous Machines
The purpose of this paper is to present a new approach based on the Least Squares Error method for estimating the unknown parameters of the nonlinear 3rd order synchronous generator model. The proposed method uses the mathematical relationships between the machine parameters and on-line input/output measurements to estimate the parameters of the nonlinear state space model. The field voltage is...
متن کاملHighly Testable Finite State Machines Based on EXOR Logic
It is well-known that AND/EXOR circuits are more easily testable than AND/OR circuits. Therefore, in this paper, we primarily propose to use AND/EXOR realizations for implementation of the combinational logic parts of finite state machines. Then, we investigate the effect of different state assignments (i.e. one-hot, gray-code, etc.) and that of using different types of registers (i.e. D-type, ...
متن کاملSynthesis of Fast On-Line Testable Controllers for Data-Domi- nated Applications
A target structure for implementing fast on-line testable control units for data-dominated applications is presented. In many cases, the proposed controller structure leads to a performance improvement of more than 30% for a standard benchmark set whereas the area overhead is less than 15% compared with conventional on-line testable finite state machines (FSM). The proposed approach is compatib...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کامل